Computational Algorithm for Higher Order Legendre Polynomial and Gaussian Quadrature Method
نویسندگان
چکیده
There are many numerical methods adopted to solve mathematical problems. Early researchers focused on the methods to reduce computational costs. In recent years, reduction in computational costs makes many numerical methods available which were not tried for this reason. The use of higher order Legendre polynomials for more than 5-7 orders is usually not common. The efficient and quick numerical methods like Gaussian Quadrature were not adopted for higher orders. In this paper a very simple computational algorithm is adopted for calculations of higher order Legendre polynomials and its use for Gaussian quadrature numerical integration till 44 order.
منابع مشابه
Local Error Control in the RK5GL3 Method
The RK5GL3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on a combination of a fifth-order Runge-Kutta method and 3-point Gauss-Legendre quadrature. In this paper we describe an effective local error control algorithm for RK5GL3, which uses local extrapolation with an eighth-order Runge-Kutta method in tandem with RK5GL3, and a ...
متن کاملA Gaussian quadrature rule for oscillatory integrals on a bounded interval
We investigate a Gaussian quadrature rule and the corresponding orthogonal polynomials for the oscillatory weight function ei!x on the interval [ 1, 1]. We show that such a rule attains high asymptotic order, in the sense that the quadrature error quickly decreases as a function of the frequency !. However, accuracy is maintained for all values of ! and in particular the rule elegantly reduces ...
متن کاملOne-Step Piecewise Polynomial Galerkin Methods for Initial Value Problems*
A new approach to the numerical solution of systems of first-order ordinary differential equations is given by finding local Galerkin approximations on each subinterval of a given mesh of size h. One step at a time, a piecewise polynomial, of degree n and class C°, is constructed, which yields an approximation of order 0(A*") at the mesh points and 0(A"+1) between mesh points. In addition, the ...
متن کاملExplicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the interpolation points. Few explicit formulae for these barycentric weights are known. In [H. Wang and S. Xiang, Math. Comp., 81 (2012), 861–877], the authors have shown t...
متن کاملIteration-Free Computation of Gauss-Legendre Quadrature Nodes and Weights
Gauss–Legendre quadrature rules are of considerable theoretical and practical interest because of their role in numerical integration and interpolation. In this paper, a series expansion for the zeros of the Legendre polynomials is constructed. In addition, a series expansion useful for the computation of the Gauss–Legendre weights is derived. Together, these two expansions provide a practical ...
متن کامل